Emotions as Objects of Argumentative Constructions
نویسندگان
چکیده
منابع مشابه
Viewing Boundary "Objects" as Boundary Constructions
* Department of Management and Technology, School of Management, University of Quebec at Montreal (UQAM), Montreal, Canada – E-mail: [email protected] and [email protected] † Department of Management, HEC Montréal, Montreal, Canada – E-mail: [email protected] and [email protected] Empirical results from a qualitative study within an important North American aircraft engine manuf...
متن کاملProbabilistic constructions of computable objects
A nonconstructive proof can be used to prove the existence of an object with some properties without providing an explicit example of such an object. A special case is a probabilistic proof where we show that the object with required properties appears with some positive probability in a random process. Can we use such an argument to prove the existence of a computable infinite object? Sometime...
متن کاملUniversal Constructions for Large Objects
We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object state, which is impractical for large objects. Previous attempts to address this problem require programmers to explicitly fragment large objects into smaller, more manageable pieces, paying particular attention to ho...
متن کاملAn Analysis of Persian Compound Nouns as Constructions
In Construction Morphology (CM), a compound is treated as a construction at the word level with a systematic correlation between its form and meaning, in the sense that any change in the form is accompanied by a change in the meaning. Compound words are coined by compounding templates which are called abstract schemas in CM. These abstract constructional schemas generalize over sets of existing...
متن کاملOn fixpoint objects and gluing constructions
This article 1 has two parts: In the rst part, we present some general results about xpoint objects. The minimal categorical structure required to model soundly the equational type theory which combines higher order recursion and computation types (introduced by 4]) is shown to be precisely a let-category possessing a xpoint object. Functional completeness for such categories is developed. We a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Argumentation
سال: 2008
ISSN: 0920-427X,1572-8374
DOI: 10.1007/s10503-008-9120-0